On the global convergence of the inexact semi-smooth Newton method for absolute value equation
نویسندگان
چکیده
منابع مشابه
On the global convergence of the inexact semi-smooth Newton method for absolute value equation
In this paper, we investigate global convergence properties of the inexact nonsmooth Newton method for solving the system of absolute value equations (AVE). Global Q-linear convergence is established under suitable assumptions. Moreover, we present some numerical experiments designed to investigate the practical viability of the proposed scheme.
متن کاملOn Convergence of the Additive Schwarz Preconditioned Inexact Newton Method
The additive Schwarz preconditioned inexact Newton (ASPIN) method was recently introduced [X.-C. Cai and D. E. Keyes, SIAM J. Sci. Comput., 24 (2002), pp. 183–200] to solve the systems of nonlinear equations with nonbalanced nonlinearities. Although the ASPIN method has successfully been used to solve some difficult nonlinear equations, its convergence property has not been studied since it was...
متن کاملOn the Convergence of Inexact Newton Methods
A solid understanding of convergence behaviour is essential to the design and analysis of iterative methods. In this paper we explore the convergence of inexact iterative methods in general, and inexact Newton methods in particular. A direct relationship between the convergence of inexact Newton methods and the forcing terms is presented in both theory and numerical experiments.
متن کاملA note on unique solvability of the absolute value equation
It is proved that applying sufficient regularity conditions to the interval matrix $[A-|B|,A + |B|]$, we can create a new unique solvability condition for the absolute value equation $Ax + B|x|=b$, since regularity of interval matrices implies unique solvability of their corresponding absolute value equation. This condition is formulated in terms of positive deniteness of a certain point matrix...
متن کاملGlobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2016
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-016-9837-x